Imprimitive Symmetric Graphs
نویسنده
چکیده
A finite graph Γ is said to be G-symmetric if G is a group of automorphisms of Γ acting transitively on the ordered pairs of adjacent vertices of Γ. In most cases, the group G acts imprimitively on the vertices of Γ, that is, the vertex set of Γ admits a nontrivial G-invariant partition B. The purpose of this thesis is to study such graphs, called imprimitive G-symmetric graphs. In the first part of the thesis, we discuss in detail the geometric approach, introduced by Gardiner and Praeger in 1995, for studying imprimitive symmetric graphs which we use throughout. According to this approach, three configurations can be associated with (Γ,B), namely the quotient graph ΓB of Γ with respect to B, the bipartite subgraph Γ[B,C] of Γ induced by two adjacent blocks B,C of B, and a certain 1-design D(B) induced on B (possibly with repeated blocks). The approach involves an analysis of these configurations and addresses the problem of reconstructing Γ from the triple (ΓB,Γ[B,C],D(B)). In the second part, we study the case where the block size k of D(B) is one less than the block size v of B. We first assume that D(B) contains no repeated blocks, and prove that, under the assumption k = v − 1 ≥ 2, this occurs precisely when ΓB is (G, 2)-arc transitive. In this case, we find a very natural and simple construction of Γ from ΓB and the induced action of G on B, and prove that up to isomorphism it produces all such graphs Γ. If in addition ΓB is a complete graph, then we classify all the possibilities for (Γ, G). We show that Γ[B,C] ∼= Kv−1,v−1 if and only if ΓB is (G, 3)-arc transitive, and that Γ[B,C] is a matching of v − 1 edges and ΓB is not a complete graph if and only if ΓB is a certain near n-gonal graph for some even integer n ≥ 4. In the general case where D(B) may contain repeated blocks, we give a construction of such graphs from G-pointand G-block-transitive 1-designs, and prove further that up to isomorphism it gives rise to all such graphs. By using this, we then classify such graphs arising from the classical projective and affine geometries. In the last part, we will investigate the influence of certain “local” actions induced by the setwise stabilizer GB on the structure of Γ, with emphasis on the case where Γ is G-locally quasiprimitive. In particular, we will study the case where the actions of GB on B and on the neighbourhood of B in ΓB are permutationally isomorphic.
منابع مشابه
Solution to a Question on a Family of Imprimitive Symmetric Graphs
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin. 31 (2010), 362–367] regarding a family of imprimitive symmetric graphs. 2000 Mathematics subject classification: primary 05C25; secondary 05E99.
متن کاملA Geometrical Approach to Imprimitive Graphs
We establish a geometrical framework for the study of imprimitive, G-symmetric graphs F by exploiting the fact that any G-partition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block B e B . We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is e...
متن کاملFinite symmetric graphs with two-arc transitive quotients
This paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric graphs, namely for graphs admitting an automorphism groupG that is transitive on ordered pairs of adjacent vertices, and leaves invariant a nontrivial vertex partition B. Such a group G is also transitive on the ordered pairs of adjacent vertices of the quotient graph B corresponding toB. If in additionG is ...
متن کاملImprimitive Distance-Transitive Graphs with Primitive Core of Diameter at Least 3
A distance-transitive graph G is one upon which the automorphism group acts transitively on ordered pairs of vertices at every fixed distance. Only connected graphs need to be considered. Those of diameter 2 are the rank-3 graphs, whose careful study was initiated by Donald G. Higman in his breakthrough paper [16]. A huge amount of effort has gone into the classification of all finite distancet...
متن کاملOn the metric dimension of imprimitive distance-regular graphs
A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. Much attention has been paid to the metric dimension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimens...
متن کاملImprimitive symmetric graphs with cyclic blocks
Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of size v ≥ 3. In this paper we study such graphs where: for B, C ∈ B connected by some edge of Γ , exactly two vertices of B lie on no edge with a vertex of C; and as C runs over all parts of B connected to B these vertex pairs (ignoring multiplicities) form a cycle. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005